Using auctions to allocate chores∗
نویسنده
چکیده
In this paper we present an application of the auction mechanisms to the allocation of a chore (a bad) to one of the bidders belonging to a given set B. We also discuss an extension of such an application to the allocation of a set of chores among an initial set of bidders B. The paper aims at showing how the classic auction mechanism can be modified and adapted for the allocation of bads (chores) instead of the allocation of goods. keywords: auctions, allocation of bads, compensation criteria, mechanism design, performance criteria JEL Classification codes: C70, D44, D61, D63, D82
منابع مشابه
Optimal Auctions Capturing Constraints in Sponsored Search
Most sponsored search auctions use the Generalized Second Price (GSP) rule. Given the GSP rule, they try to give an optimal allocation, an easy task when the only need is to allocate ads to slots. However, when other practical conditions must be fulfilled –such as budget constraints, exploration of the performance of new ads, etc.– optimal allocations are hard to obtain. We provide a method to ...
متن کاملProgress on Agent Coordination with Cooperative Auctions
Auctions are promising decentralized methods for teams of agents to allocate and re-allocate tasks among themselves in dynamic, partially known and time-constrained domains with positive or negative synergies among tasks. Auctionbased coordination systems are easy to understand, simple to implement and broadly applicable. They promise to be efficient both in communication (since agents communic...
متن کاملTariffying auctions
A strategy to convert quotas to tariffs is to auction the quota rights and use the realized auction prices as guides to setting tariffs. In the 1980s, New Zealand employed auctions to allocate quota licenses. We analyze the relationship between tariff-equivalents and auction prices for auctions with resale. Using panel data from New Zealand’s quota license auctions, we estimate the expected val...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملOn Characterizations of Truthful Mechanisms for Combinatorial Auctions and Scheduling (Addendum)
We show that the only social choice functions that are implementable in a multi-unit auctions setting with two bidders which always allocate all items are affine maximizers.
متن کامل